Multivariable polynomial injections on rational numbers

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multivariable polynomial injections on rational numbers

For each number field k, the Bombieri-Lang conjecture for k-rational points on surfaces of general type implies the existence of a polynomial f(x, y) ∈ k[x, y] inducing an injection k × k → k.

متن کامل

Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect to termination proving power, Lucas managed to prove in 2006 that there are rewrite systems that can be shown polynomially terminating by polynomial interpre...

متن کامل

On Polynomial Time Computable Numbers

The computable numbers have already appeared in Turing’s paper [6] in which he defined the Turing machine. Turing defined them in real numbers, the definition is naturally extended to complex numbers. Rice showed that the whole complex computable numbers forms an algebraically closed field [4]. The field is strictly larger than the algebraic number fields Q since it contains transcendental numb...

متن کامل

On Computable Automorphisms of The Rational Numbers

The relationship between ideals I of Turing degrees and groups of I{recursive automorphisms of the ordering on rationals is studied. We discuss the diierences between such groups and the group of all auto-morphisms, prove that the isomorphism type of such a group completely deenes the ideal I, and outline a general correspondence between principal ideals of Turing degrees and the rst{order prop...

متن کامل

Accelerating Homomorphic Computations on Rational Numbers

Fully Homomorphic Encryption (FHE) schemes are conceptually very powerful tools for outsourcing computations on confidential data. However, experience shows that FHE-based solutions are not sufficiently efficient for practical applications yet. Hence, there is a huge interest in improving the performance of applying FHE to concrete use cases. What has been mainly overlooked so far is that not o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Arithmetica

سال: 2010

ISSN: 0065-1036,1730-6264

DOI: 10.4064/aa145-2-2